Search for: All records

We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. This class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine ideas from quantum Gibbs sampling and matrix exponent updates. A de-quantization of the algorithm also leads to a faster classical solver. For generic instances, our quantum solver gives a nearly quadratic speedup over state-of-the-art algorithms. Such instances include approximating the ground state of spin glasses and MaxCut on Erdös-Rényi graphs. We also provide an efficient randomized rounding procedure that converts approximately optimal SDP solutions into approximations of the original quadratic optimization problem. 

Producing quantum states at random has become increasingly important in modern quantum science, with applications being both theoretical and practical. In particular, ensembles of such randomly distributed, but pure, quantum states underlie our understanding of complexity in quantum circuits1 and black holes2, and have been used for benchmarking quantum devices3,4 in tests of quantum advantage5,6. However, creating random ensembles has necessitated a high degree of spatio-temporal control7,8,9,10,11,12 placing such studies out of reach for a wide class of quantum systems. Here we solve this problem by predicting and experimentally observing the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics, which we use to implement an efficient, widely applicable benchmarking protocol. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system, offering new insights into quantum thermalization13. Predicated on this discovery, we develop a fidelity estimation scheme, which we demonstrate for a Rydberg quantum simulator with up to 25 atoms using fewer than 104 experimental samples. This method has broad applicability, as we demonstrate for Hamiltonian parameter estimation, target-state generation benchmarking, and comparison of analogue and digital quantum devices. Our work has implications for understanding randomness in quantum dynamics14 and enables applications of this concept in a much wider context 4,5,9,10,15,16,17,18,19,20.